spectral radius
英 [ˈspektrəl ˈreɪdiəs]
美 [ˈspektrəl ˈreɪdiəs]
网络 谱半径
双语例句
- Inequalities of the Spectral Radius of Kronecker Products for Random Matrix Functions
随机矩阵函数Kronecker积的谱半径的不等式 - We give a proof of some upper bounds for the spectral radius of graphs.
该文给出了图的谱半径的一个可达上界的证明。 - For solving the linear system with the iterative method, it is very important to estimate the spectral radius of the iterative matrices.
在用迭代法解线性方程组时，迭代矩阵的谱半径估计在迭代法的收敛性分析中起着重要的作用。 - A New Estimation of Upper for Spectral Radius in Brauer Theorem
Brauer定理中谱半径上界的新估计 - With the theories of matrix analysis, a method to estimate the spectral radius of M-matrices is presented, and some conclusions connected with the method are also introduced in brief.
运用矩阵分析理论，给出了估计M-矩阵谱半径的一种方法，并且对其相关结论略作阐述。 - Spectral radius of unicyclic graphs given order and edge independence number
给定阶和边独立数的单圈图的谱半径 - New Proofs for Two Upper Bounds on the Laplacian Spectral Radius of Graphs
关于图的Laplacian谱半径上界两个重要结果的新证明 - Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。 - We have one on our books in Streatham. Spectral radius of unicyclic graphs given order and edge independence number
现在在Streatham有一栋半独立式房子要出售。给定阶和边独立数的单圈图的谱半径 - In this paper, the author obtains an upper bound of the spectral radius of oriented graphs by letting D be an oriented graph with n vertices.
利用定向图的邻接矩阵的特性，得到了定向图的邻接谱的谱半径的一个可达上界。 - Estimation of new bounds on the spectral radius of nonnegative matrix
非负矩阵谱半径的一个新界值估计 - G~ (-++) and G~ (+&) are regular if and only if G is ( n-1)/ 2-regular. We also give some upper bounds on the spectral radius of transformation graphs. Then we estimate these upper bounds.
G~（-++）和G~（+&）是正则的当且仅当G是（n-1）/2-正则图.同时还讨论了变换图的谱半径上界，并对这些上界进行了估计。 - Regularity and Spectral Radius of Transformation Graphs
变换图的正则性和谱半径 - The bounds of the spectral radius of the iteration matrix of Gauss-Seidel and AOR are also presented.
文中也讨论了Gauss-Seidel，AOR迭代法的迭代阵的谱半径的上界估计。 - A method of spectral radius is given to evaluate the asymptotical stabilization of linear switched system.
给出线性切换系统渐近稳定的谱半径判别方法。 - When the spectral radius of the iterative matrix is less than 1, smaller and more quick.
在迭代矩阵谱半径小于1的情况下，值越小收敛速度越快。 - Schwarz's lemma for the spectral radius in complex Banach Algebras
Banach代数中对谱半径的Schwarz引理 - Conclusion Norm of operator is very important to estimate the spectral radius of operator.
结论算子范数对于估计有界线性算子乘积与和的谱半径是至关重要的。 - It is proved in this paper that the minimal characterizing number of a matrix is equal to the spectral radius of the corresponding non-negative matrix.
本文对一个矩阵的最小示性数进行了研究，并证明了一个矩阵的最小示性数等于其对应的非负矩阵的谱半径。 - Spectral radius is an important global characteristics of an irreducible Markov chain.
谱半径是不可约马尔可夫链的一个很重要的特征数字。 - New Lower Bounds on the Spectral Radius of Adjacency Matrices and Laplacian Matrices of Trees
树的邻接矩阵和Laplacian矩阵谱半径的新下界 - This paper investigates the smallest singular value of matrices, the spectral radius of the iterative matrix, the minimal eigenvalue of irreducible M-matrices and some spectral properties of tensor product of matrices.
本文主要研究了矩阵最小奇异值，迭代矩阵的谱半径，不可约M矩阵的最小特征值以及矩阵张量积的一些谱性质。 - At the same time, for the process additive and multiplicative uncertainties mostly encountered in practice, the sufficient and necessary conditions for holding the control system robust stability are analyzed, and thus, an intuitive determination method is provided based on the spectral radius criterion.
同时，对于实际中最常见的被控过程的加性和乘性不确定性，分析了控制系统保证鲁棒稳定性的充要条件，由此给出了基于谱半径判据的直观判定方法。 - On the Spectral Radius of Two Types of Graphs
两类图的谱半径和极图 - Estimate for the spectral radius of iterative matrices.
迭代矩阵的谱半径估计。 - The relationship is also revealed between spectral radius of trees and independence number, covering number, edge covering number as well as total independence number.
借助该结论，也得到了树的谱半径与其独立数、覆盖数、边覆盖数和全独立数之间的关系。 - The eigenvalue and the spectral radius of linear completely continuous operators are very important and significant indexes.
线性全连续算子的特征值和谱半径是非常重要的、具有实际意义的指标。 - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix.
3谱半径是指图的邻接矩阵的特征多项式的最大特征根。 - The estimation of spectral radius is discussed based on its concept. 4.
本文在谱半径概念的基础上，讨论了谱半径的估计。